Opaque profile identifiers for path computation element protocol

ABSTRACT

Methods and systems are disclosed for enabling centralized path definition and policy with distributed path setup, and centralized path setup control with distributed path utilization constraints. In one example, a path computation client (PCC) requests, utilizing opaque PCE profile identifiers, path computation from a path computation element (PCE). The PCE profile identifier corresponds to path computation constraints, stored local to PCE, and are unknown to the PCC. Advantageously, the PCE profile identifiers allow the PCC to initiate path computation requests based on information local the PCC while leveraging centralized computation by the PCE. In another example, a PCE requests, utilizing opaque PCC profile identifiers, that a PCC initiate a path. The PCC profile identifier corresponds to path usage constraints, stored local to PCC, and are unknown to the PCE. Advantageously, the PCC identifiers allow the PCE to marshal path initiation while leveraging distributed resources to enforce compliance with usage parameters.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims the benefit of priority under 35 U.S.C. §119(e)to U.S. Provisional Application Ser. No. 61/947,323, entitled“CENTRALIZED PATH DEFINITION WITH DISTRIBUTED PATH SETUP CONTROL” filedMar. 3, 2014, to U.S. Provisional Application Ser. No. 62/000,982,entitled “CENTRALIZED PATH DEFINITION WITH DISTRIBUTED PATH SETUPCONTROL” filed May 20, 2014, and to U.S. Provisional Application Ser.No. 62/009,051, entitled “PATH SETUP WITH ENCODED PATH PARAMETERS” filedJun. 6, 2014, each of which is hereby incorporated by reference in theirentirety.

TECHNICAL FIELD

This disclosure relates in general to the field of networkcommunications and, more particularly, to utilizing opaque identifiersin path computation element communication protocol (PCEP) forcentralized path definition and policy with distributed path setupcontrol, and centralized path setup control with distributed pathutilization constraints.

BACKGROUND

Modern networks may include distributed and centralized components. Forexample, a network may include many distributed nodes (e.g., routers)and may include a central controller for managing the nodes. In the caseof network elements that compute paths from a source to a destination(e.g., path computation elements) and network elements that request pathcomputation (e.g., path computation clients), the network elements mayeither be distributed or centralized.

BRIEF DESCRIPTION OF THE DRAWINGS

To provide a more complete understanding of the present disclosure andfeatures and advantages thereof, reference is made to the followingdescription, taken in conjunction with the accompanying figures, whereinlike reference numerals represent like parts, in which:

FIG. 1 is a simplified schematic diagram illustrating network accordingto an embodiment of the disclosure.

FIG. 2 illustrates a profile capability Type-Length-Value (TLV)extension to the PCEP OPEN object, according an embodiment of thepresent disclosure.

FIG. 3 illustrates a profile object, which extends PCEP according to anembodiment of the present disclosure.

FIG. 4 illustrates a profile identifier TLV, which extends PCEP,according to an embodiment of the present disclosure.

FIG. 5 is a simplified schematic diagram illustrating a system forPCC-initiated paths, according to an embodiment of the disclosure

FIG. 6 is a simplified schematic diagram illustrating a system forPCE-initiated paths, according to an embodiment of the disclosure.

FIG. 7 is a simplified schematic diagram illustrating a system forPCC-initiated paths and PCE-initiated paths, according to an embodimentof the disclosure.

FIG. 8 is a simplified schematic diagram illustrating messages generatedby a system for PCC-initiated paths, according to an embodiment of thedisclosure.

FIG. 9 illustrates exemplary logic or a method for enabling centralizedpath definition and policy with distributed path setup control forPCC-initiated paths, according to an embodiment of the presentdisclosure.

FIG. 10 illustrates exemplary logic or a method for enabling centralizedpath definition and policy with distributed path setup control forPCC-initiated paths, according to an embodiment of the presentdisclosure.

FIG. 11 is a table illustrating exemplary PCE profiles, according to anembodiment of the present disclosure.

FIGS. 12A and 12B are simplified schematic diagrams illustrating anexemplary system and workflow for enabling generating a path based on apolicy local to a PCC, according to an embodiment of the presentdisclosure.

FIGS. 13A and 13B are simplified schematic diagrams illustrating anexemplary system and workflow for establishing fully disjoint paths,according to an embodiment of the present disclosure.

FIG. 14 is a simplified schematic diagram illustrating messagesgenerated by a system for PCE-initiated paths, according to anembodiment of the disclosure.

FIG. 15 illustrates exemplary logic or a method for enabling centralizedpath setup control with distributed path utilization constraints forPCE-initiated paths, according to an embodiment of the presentdisclosure.

FIG. 16 illustrates exemplary logic or a method for enabling centralizedpath setup control with distributed path utilization constraints forPCE-initiated paths, according to an embodiment of the presentdisclosure.

FIGS. 17A and 17B are simplified schematic diagrams illustrating anexemplary system and workflow for implementing a network service,according to an embodiment of the present disclosure.

FIGS. 18A and 18B are tables illustrating exemplary PCC profiles,according to one or more embodiments of the present disclosure.

FIG. 19 is a simplified schematic diagram illustrating messagesgenerated by a system for PCC-initiated paths, according to anembodiment of the disclosure.

FIG. 20 is a simplified schematic diagram illustrating messagesgenerated by a system for PCE-initiated paths, according to anembodiment of the disclosure.

FIG. 21 is a table of exemplary encodings for profile objects, accordingto an embodiment of the present disclosure.

FIG. 22 illustrates a profile identifier TLV, which extends PCEP,according to an embodiment of the present disclosure.

DETAILED DESCRIPTION OF EXAMPLE EMBODIMENTS Overview

In an embodiment, a method for requesting path computation by a pathcomputation client (PCC) comprises storing, in a memory accessible by apath computation client (PCC), at least one profile identifier;generating, by the PCC, a path computation element communicationprotocol (PCEP) request message comprising a destination identifier anda profile identifier of the at least one profile identifier, wherein thegenerating the PCEP request message is in response to detecting anetwork state that is local to the PCC; transmitting, from the PCC, thePCEP request message to a path computation element (PCE); and receiving,by the PCC from the PCE, a PCEP reply message comprising a path from thePCC to a destination associated with the destination identifier, whereinthe path satisfies at least one path constraint, stored remote from thePCC, corresponding to the profile identifier.

In an embodiment, a method for replying, by a path computation element(PCE), to a path computation request comprises storing, in a memoryaccessible by a path computation element (PCE), at least one profileidentifier and at least one corresponding path constraint; receiving, atthe PCE from a path computation client (PCC), a path computation elementcommunication protocol (PCEP) request message comprising a destinationidentifier and a profile identifier of the at least one profileidentifier, wherein the PCC generated the PCEP request message inresponse to detecting a network state that is local to the PCC;generating, by the PCE, a PCEP reply message comprising a pathparameters describing a path from the PCC to a destination associatedwith the destination identifier, wherein the path computation parametersare computed by the PCE based on the at least one corresponding pathconstraint for the profile identifier.

In an embodiment, a system for communication, comprises a pathcomputation element (PCE) comprising a memory storing at least oneprofile identifier and at least one corresponding path constraint; apath computation client (PCC) comprising a memory storing the at leastone profile identifier and not storing the at least one correspondingpath constraint; a communication media operatively coupled to the PCEand the PCC and enabling communication between the PCE and the PCC;wherein the PCC transmits, to the PCE via the communication media, apath computation element communication protocol (PCEP) request messagecomprising a destination identifier and a profile identifier of the atleast one profile identifier, wherein the generating the PCEP requestmessage is in response to detecting a network state that is local to thePCC and the PCE has no information regarding the network state that islocal to the PCC; and wherein the PCE generates a PCEP reply message,for transmission to the PCC via the communication media, comprising apath from the PCC to a destination associated with the destinationidentifier, and the path is computed by the PCE based on the at leastone corresponding path constraint for the profile identifier.

In an embodiment, at least one computer-readable non-transitory mediumcomprising one or more instruction, that when executed by one or moreprocessors configure the one or more processor to perform one or moreoperations comprises storing, in a memory accessible by a pathcomputation client (PCC), at least one profile identifier; generating,by the PCC, a path computation element communication protocol (PCEP)request message comprising a destination identifier and a profileidentifier of the at least one profile identifier, wherein thegenerating the PCEP request message is in response to detecting anetwork state that is local to the PCC; transmitting, from PCC, the PCEPrequest message to a path computation element (PCE); and receiving, bythe PCC from the PCE, a PCEP reply message comprising a path from thePCC to a destination associated with the destination identifier, whereinthe path satisfies at least one path constraint, stored remote from thePCC, corresponding to the profile identifier.

In an embodiment, at least one computer-readable non-transitory mediumcomprising one or more instruction, that when executed by one or moreprocessors configure the one or more processor to perform one or moreoperations comprises storing, in a memory accessible by a pathcomputation element (PCE), at least one profile identifier and at leastone corresponding path constraint; receiving, at the PCE from a pathcomputation client (PCC), a path computation element communicationprotocol (PCEP) request message comprising a destination identifier anda profile identifier of the at least one profile identifier, wherein thePCC generated the PCEP request message in response to detecting anetwork state that is local to the PCC; generating, by the PCE, a PCEPreply message comprising a path from the PCC to a destination associatedwith the destination identifier, wherein the path is computed by the PCEbased on the at least one corresponding path constraint for the profileidentifier.

In an embodiment, a method for initiating a path by a path computationelement (PCE) comprises storing, in a memory accessible by a pathcomputation element (PCE), at least one profile identifier; computing,by the PCE, path parameters describing a path from a path computationclient (PCC) to a path destination; generating, by the PCE, a pathcomputation element communication protocol (PCEP) initiate messagecomprising the path parameters, the path destination, and a profileidentifier of the at least one profile identifier; wherein the PCEPinitiate message is generated in response to a request message receivedby the PCE; and transmitting, from the PCE, the PCEP initiate message tothe PCC.

In an embodiment, a method for generating a path by a path computationclient (PCE) comprises storing, in a memory accessible by a pathcomputation client (PCC), at least one profile identifier and at leastone corresponding path usage parameter; receiving, at the PCC from apath computation element (PCE), a path computation element communicationprotocol (PCEP) initiate message comprising the path parameters, thepath destination, and a profile identifier of the at least one profileidentifier, wherein the PCEP initiate message is generated in responseto a request message received by the PCE; generating, by the PCC, thepath based on the path parameters; wherein utilization of the pathconforms to the at least one path usage parameter corresponding to theprofile identifier associated with the path.

In an embodiment, a system for communication comprises a pathcomputation client (PCC) comprising a memory storing at least oneprofile identifier and at least one corresponding path usage parameter;a path computation element (PCE) comprising a memory storing the atleast one profile identifier and not storing the at least onecorresponding usage parameter; a communication media operatively coupledto the PCE and the PCC and enabling communication between the PCE andthe PCC; wherein the PCE transmits to the PCC, via the communicationmedia, a path computation element communication protocol (PCEP) initiatemessage comprising path parameters and a profile identifier of the atleast one profile identifier, the PCEP initiate message being generatedin response to a request message received by the PCE; and wherein thePCC generates the path based on the path parameters; wherein utilizationof the path follows the at least one corresponding path usage parameterfor the profile identifier.

In an embodiment, at least one computer-readable non-transitory mediumcomprising one or more instruction, that when executed by one or moreprocessors configure the one or more processor to perform one or moreoperations comprises storing, in a memory accessible by a pathcomputation element (PCE), at least one profile identifier; computing,by the PCE, path parameters describing a path from a path computationclient (PCC) to a path destination; generating, by the PCE, a pathcomputation element communication protocol (PCEP) initiate messagecomprising the path parameters, the path destination, and a profileidentifier of the at least one profile identifier; wherein the PCEPinitiate message is generated in response to a request message receivedby the PCE; and transmitting, from the PCE, the PCEP initiate message tothe PCC.

In an embodiment, at least one computer-readable non-transitory mediumcomprising one or more instruction, that when executed by one or moreprocessors configure the one or more processor to perform one or moreoperations comprises storing, in a memory accessible by a pathcomputation client (PCC), at least one profile identifier and at leastone corresponding path usage parameter; receiving, at the PCC from apath computation element (PCE), a path computation element communicationprotocol (PCEP) initiate message comprising the path parameters, thepath destination, and a profile identifier of the at least one profileidentifier, wherein the PCEP initiate message is generated in responseto a request message received by the PCE; generating, by the PCC, thepath based on the path parameters; wherein utilization of the pathfollows the at least one path usage parameter corresponding to theprofile identifier.

In an embodiment, a method comprises storing, in a memory accessible bya first network element, an ordered list comprising a profile identifierand at least one attribute associated with the profile identifier,wherein the profile identifier and the at least one attribute areprovided in a particular order in the ordered list; receiving a pathcomputation element communication protocol (PCEP) message, from a secondnetwork element, comprising at least one profile identifier and at leastone argument value associated with each of the at least one profileidentifier; in response to determining that the at least one profileidentifier in the PCEP message comprises the profile identifier,processing the PCEP message to identify the at least one argument valuebased on the particular order in the ordered list; and executing, by thefirst network element, an action based on the at least one argumentvalue identified in the processing.

In an embodiment, a method comprises generating, by a first networkelement, a path computation element communication protocol (PCEP)message comprising at least one profile identifier and at least oneargument value associated with each of the at least one profileidentifier, wherein the at least one profile identifier and at least oneargument value are provided in an order in the PCEP message; andtransmitting the PCEP message to a second network element, wherein thePCEP message causes the second network element to execute an action inresponse to determining that the order in the PCEP message correspondsto a particular order of a profile identifier and at least one attributeassociated with the profile identifier stored on the second networkelement.

In an embodiment, a system comprises a first network element comprisinga memory storing an ordered list comprising at least one profileidentifier and at least one attribute associated with the at least oneprofile identifier, wherein the at least one profile identifier and theat least one attribute are provided in a particular order in the orderedlist; a second network element comprising a memory storing a profileidentifier and at least one argument value associated with the profileidentifier; a communication media operatively coupled to and enablingcommunication between the first network element and the second networkelement; wherein the second network element transmits a path computationelement communication protocol (PCEP) message, to the first networkelement via the communication media, comprising the profile identifierand the at least one argument value associated with the profileidentifier; and wherein the first network element, processes the PCEPmessage to identify the at least one argument value based on theparticular order in the ordered list and executes an action based on theat least one argument value identified in the processing.

In an embodiment, at least one computer-readable non-transitory mediumcomprising one or more instruction, that when executed by one or moreprocessors configure the one or more processor to perform one or moreoperations comprises storing, in a memory accessible by a first networkelement, an ordered list comprising a profile identifier and at leastone attribute associated with the profile identifier; wherein theprofile identifier and the at least one attribute are provided in aparticular order in the ordered list; receiving a path computationelement communication protocol (PCEP) message, from a second networkelement, comprising at least one profile identifier and at least oneargument value associated with each of the at least one profileidentifier; in response to determining that the at least one profileidentifier in the PCEP message comprises the profile identifier,processing the PCEP message to identify the at least one argument valuebased on the particular order in the ordered list; and executing, by thefirst network element, an action based on the at least one argumentvalue identified in the processing.

In an embodiment, at least one computer-readable non-transitory mediumcomprising one or more instruction, that when executed by one or moreprocessors configure the one or more processor to perform one or moreoperations comprises generating, by a first network element, a pathcomputation element communication protocol (PCEP) message comprising atleast one profile identifier and at least one argument value associatedwith each of the at least one profile identifier, wherein the at leastone profile identifier and at least one argument value are provided inan order in the PCEP message; and transmitting the PCEP message to asecond network element, wherein the PCEP message causes the secondnetwork element to execute an action in response to determining that theorder in the PCEP message corresponds to a particular order of a profileidentifier and at least one attribute associated with the profileidentifier stored on the second network element.

Example Embodiments

Network service state often resides distributed in the network.Controlling the setup of network paths using the distributed networkservice state, while maintaining centralized path definition and policyfor path computation can present a challenge. In this context, pathdefinition refers to a detailed description of path parameters (pathattributes, path description parameters) and/or tasks required toidentify the path (e.g. path computation). Some approaches, such asMultiprotocol Label Switching (MPLS) Traffic Engineering (TE) andsegment routing (SR) TE, may support distributed path definition withdistributed path setup control, or centralized path definition withcentralized path setup control. Path parameters may include parametersExplicit Route Object (ERO), bandwidth, affinities, etc. for ResourceReservation Protocol-Traffic Engineering (RSVP-TE), Segment Routing(SR), label stack, etc. In distributed path definition with distributedpath setup control, a path (tunnel) configuration resides on each headend, which controls when a path is setup. In these systems, no PathComputation Element (PCE) used. In centralized path definition withcentralized path setup control, PCE-initiated path setup enables anoperator to centralize both path definition and path setup.

An existing challenge is to centralize path definition and policy withdistributed path setup control. Centralizing path definition and policycan simplify network operations. Distributing setup control (e.g., torouter and switches in the network) allows the network to leverage itsdistributed state (e.g., network state information that is local to arouter or switch) to make decisions as to which point in time (and/or inwhich conditions/states) to set up a path. For example, routing andsignaling information can define how network services (e.g., Layer 3Virtual Private Networks (L3VPN), Internet Protocol version 4 (IPv4),Internet Protocol version 6 (IPv6), Virtual Private LAN service (VPLS),etc.) can signal path preferences via their control plane (e.g., usingBorder Gateway Protocol (BGP) or Label Distribution Protocol (LDP)). Theservice state in combination with local policies and/or configurationcan trigger the creation of paths (e.g., Traffic Engineered LabelSwitched paths (TE LSPs), Segment Routed Traffic Engineering paths(SR-TE paths), etc.), between Provider Edge (PE) devices. In oneexample, the systems and methods described herein relocate some policiesand/or configuration to a central path computation element (PCE) whilestill allowing service nodes to trigger (PCC-initiated) the creation ofpaths (e.g., TE LSPs and/or SR-TE paths) based on distributed servicestate. Centralized path definition/computation provides a significantreduction on operational complexity while distributed path creationmakes use of network intelligence that doesn't reside anywhere else. Inanother example, the systems and methods described herein allowcentralized controllers/processors to instruct path creation(PCE-initiated), while leveraging nodes (e.g., router, switches, etc.)to store and locally enforce path usage constraints, which may specifythe way in which the path can be utilized.

FIG. 1 is a simplified schematic diagram illustrating network accordingto an embodiment of the disclosure. FIG. 1 illustrates system 100, whichcomprises a PCE 102, a path database 104, a traffic engineering (e.g.,network topology) database (TED) 106, and a network 108. Network 108includes routers 110 a-110 h, each of which is operatively coupled to atleast one other node in the network. PCE 102 is operatively coupled topath database 104, TED database 106, and a network 108. PCE 102 maycommunicate with any node within the network (e.g., any of routers 110a-110 h) or nodes from other networks. For simplicity, PCE 102 is shownin communication with router 110 a. PCE 102 is able to transmit amessage 114 to router 110 a in network 108. Router 110 a is able totransmit a message 112 to a PCE 102.

In an implementation, Path Computation Element (PCE) 102 may be arouter, a switch, a server, or any other component capable of computinga path from a source to a destination with a network (e.g., network 108)subject to at least one path computation constraint. In some examples,PCE 102 is a server located remote from the network. In other examples,PCE 102 is a node within the network (e.g., router 110 b). PCE 102 mayretrieve data from either of path database 104, TED database, 106, orfrom other data sources (e.g., third-party databases) (not shown). Insome examples, the PCE may retrieve path parameters (or paths) from adatabase, in response to receiving a request to determine a path.

Path database 104 and TED database 106 maybe implemented as, e.g., SQLdatabases, MySQL databases, Hadoop databases, or may be any memoryelement (e.g., RAM, flash) accessible to PCE 102.

As an illustrative example, routers 110 a and 110 f may be service nodes(e.g. L3VPN, Layer 2 Virtual Private Network (L2VPN) endpoints) thatexchange service state via BGP and LDP. Router 110 f signals (e.g., bysending a message) a path preference for a particular service (e.g.,using a BGP community value). In an implementation, a messageidentifying that the peer node is associated with a network service isat least one of: an attribute corresponding to the network serviceadvertised, a community, AS path, address family, a prefix, and/or aLabel Distribution Protocol (LDP) signaling of the service. The router110 a receives, from router 110 f (a peer node), the signal identifyingthat the peer node is associated with the service. Router 110 a mayaccess a local policy, which provides a correspondence between services(or a subset of a service, e.g., a prefix) and a forwarding preference).Router 110 a may also access a local path template, which providescorrespondence between forwarding preferences and one or more profileidentifiers (profile IDs). The profile IDs may be opaque from the withrespect to the protocol. Thus, the semantics (e.g., the contents of aprofile definition) of the profile may not be defined by the protocol.Each system may define the semantics of the profile (and profile IDs)based an agreement between peers. Using the policy, the router 110 adetermines which forwarding preference corresponds to the networkservice (or network state) identified in the message. In this example,router 110 a may act as a path computation client (PCC). Router 110 amay check whether a path, of the identified forwarding preference,already exists towards 110 f. In response to determining that a pathfrom router 110 a to router 110 f (i.e., the peer node) does not existfor the determined forwarding preference, router 110 a uses the localpath template to determine whether a PCE can compute paths of thedetermined forwarding preference (e.g., as indicated by the presence ofa PCE profile id for the determined forwarding preference in the localpath template). If so, router 110 a uses the local path template toidentify the one or more profile identifiers corresponding to thedetermined forwarding preference. Router 110 a may generate a requestmessage (e.g., a path computation request) including the identified oneor more profile IDs (or a subset thereof) associated with the local pathtemplate. Then router 110 a, acting as a path computation client (PCC),sends the path computation request (e.g., using PCE CommunicationProtocol (PCEP) PCReq) to PCE 102 including the one or more profile IDs(or a subset thereof) associated with the local path template. PathComputation Element (PCE) Communication Protocol (PCEP) (i.e., RFC 5440)is a standard published by the Internet Engineering Task Force (IETF)for communication between PCEs and PCCs. PCEP specifies interactionsthat allow PCCs to request path computation from PCEs, and for PCEs toreply to the request.

In another illustrative example, a network management application mayrequire a path for a new network service. The network managementapplication may use an interface of a controller (e.g., a northboundinterface of a software defined network (SDN) controller) to instruct aPCE (e.g., PCE 102) to create the path in the network. The instructionmay be sent using representational state transfer (REST) call by thenetwork management application to the PCE. One or more profileidentifiers, included in the instruction, may each correspond to pathusage parameters, which may define restrictions on how the path may beutilized. Although the profile identifiers are sent to PCE 102, the PCEmay not have access to the semantics of the profile identifiers.Instead, the semantics may have been defined by the network managementapplication and provisioned (e.g., using Network Configuration Protocol(Netconf)) on a PCC (e.g. router 110 g). Upon receiving the instruction,PCE 102 sends a path initiate request (e.g., using a PCE CommunicationProtocol (PCEP) PCInitiate message) to the PCC 102 including the one ormore profile IDs (or a subset thereof), which were received directlyfrom the PCE. The PCC may use the semantics provisioned by the networkmanagement application identify the path usage parameter. The PCC mayset up the path and enforce any use of the path to conform to the pathusage parameter.

A new PCEP extension, presented in present specification, adds opaqueidentifiers to path computation element communication protocol (PCEP)messages for centralized path definition and policy with distributedpath setup control, and centralized path setup control with distributedpath utilization constraints. For example, the PCEP extension may allowa PCC to send, to a PCE, a PCEP message comprising one or more profileidentifiers that correspond to path computation parameters (or pathconstraints), which influence the path computation performed by the PCE.This is an example of a PCC-initiated path. Using the profileidentifiers, distributed PCCs may control the timing and/or conditionsunder which paths are created and may leverage profile definitionsstored on the PCE (remote from the PCC). In another example, the PCEPextension may allow a PCE to send, to a PCC, a PCEP message comprisingone or more profile identifiers that correspond to path usageparameters, which may define restrictions on how a path may be utilized.This is an example of a PCE-initiated path. System 1000 is not limitedto either PCC-initiated paths or PCE-initiated paths.

For example, FIGS. 2, 3, 4 illustrate exemplary PCEP extensions. FIG. 2illustrates a new profile capability Type-Length-Value (TLV) extensionto the PCEP OPEN object, according an embodiment of the presentdisclosure. The profile capability Type-Length-Value (TLV) 200 comprisesa 16-bit type 202, a 16-bit length 204, a 16-bits reserved 206, and 16bits for flags 208. PCEs and PCCs utilize the profile capability TLV toadvertise their capability to process profile identifiers (e.g., duringsession initialization). Communication using the profiles in theextension is only possible if both peers (e.g., the PCE and the PCC)advertise their capability to send and/or receive profile identifiers.After establishing that both peers are capable of communicating (i.e.,sending, receiving, processing, etc.) profile identifiers, the peers maybegin transmitting messages between one another that contain one oremore profile identifiers. FIG. 3 illustrates a profile object 302, whichextends PCEP according to an embodiment of the present disclosure. APCEs and PCCs may transmit profile objects between one another. Profileobjects have a variable length and may contain one or more profileidentifier (ID) TLVs. For example, profile object 300 includes profileID TLV 1 (302), profile ID TLV 2 (304), profile ID TLV 3 (306), . . . ,and profile ID TLV n (308). A profile object may be transmitted in aPCEP message (e.g., in a PCEP PCReq, PCInitiate and/or PCUpd message).Upon receiving a PCEP message containing a profile object, a PCC or PCEmay process the message (and the profile object) to identify one or moreprofile identifiers (i.e., profile ID TLVs) within the message. Theorder of the profile IDs is not specified by PCEP protocol. Profile IDTLVs (profile IDs) in a profile objects may be processed in the order inwhich they are provided in the message. According to the new PCEPextension in the present disclosure, the order of the profile IDs in theprofile object may advantageously ordered to match a particular order ofprofile IDs a profile definition and may encode a relationship betweenthe profile IDs. FIG. 4 illustrates an embodiment of a profile ID TLV,which extends PCEP, according to an embodiment of the presentdisclosure. Profile ID TLV 400 comprises a 16-bit type 402, a 16-bitlength 404, an 8-bit reserved portion 406, and 8-bits for flags 408, and32-bit profile identifier 410. The profile identifier 410, may beutilized as a PCC profile identifier or as PCE profile identifier (forPCE-initiated path and PCC-initiated paths, respectively).

A further extension to PCEP may include a PCInitiate message, whichallows a PCC uses profile identifiers to select path parameters or pathpolicies to be applied during the instantiation of the path. Anexemplary implementation of the PCInitiate message may be:

<PCInitiate Message> ::= <Common Header>    <PCE-initiated-Isp-list> Where:  <PCE-initiated-Isp-list> ::= <PCE-initiated-Isp-request>    [<PCE-initiated-Isp-list>]  <PCE-initiated-Isp-request> ::=(<PCE-initiated-Isp-instantiation>|   <PCE-initiated-Isp-deletion>) <PCE-initiated-Isp-instantiation> ::= <SRP>    <LSP>    <END-POINTS>   <ERO>    [PATH-PROFILE>    [<attribute-list>] <PCE-initiated-Isp-deletion> ::= <SRP>      <LSP>

FIG. 5 is a simplified schematic diagram illustrating network supportingPCC-initiated paths, according to an embodiment of the disclosure. Insystem 500, a PCC (e.g., router 510 a) may initiate path creation. Thecomponents in system 500 (FIG. 5) are similar to the components insystem 100 (FIG. 1). A key difference between systems 100 and 500 isthat system 500 comprises PCE profiles 516, stored local to the PCE. Inone embodiment, PCE profiles 516 are implemented using the extensionshown in FIGS. 2-4, and/or 22; in such a case, the PCE profiles 516corresponds to the profile object 300. PCE profiles 516 may include PCEprofile identifiers and corresponding a constraint(s), which define theprofiles. In this example, the PCC profiles (IDs and definitions) arestored only on the PCE and not on the PCC (in this case router 510 a).The PCC only stores the PCE profile identifiers and not the profiledefinition. The PCC may have no information regarding the pathconstraints (e.g., the PCE profile definition) that correspond to theprofile identifier. Storage of the PCE profile definition on the PCEadvantageously centralizes path definition and policy on the PCE, whileallowing the PCC (e.g., router 510 a) to create a path based on a(distributed) network state local to the PCC.

Using a PCEP extension, a PCC (router 510 a) may generate a pathcomputation request 512 specifying a path destination and a profileidentifier. Upon receiving the path computation request, the PCE mayquery a path database (e.g., databases 504 and/or 506), apply pathconstraints associated with the profile (e.g., PCE profile(s) 516),perform path computation, and reply with a path computation reply (e.g.,a PCEP PCRep message) 514, which includes all the path descriptionparameters (e.g., Explicit Route Object (ERO), bandwidth, affinities,etc. for Resource Reservation Protocol-Traffic Engineering (RSVP-TE) orlabel stack, etc. for Segment Routing). Upon receiving the pathcomputation reply (e.g., a PCEP PCRep message) the PCC may setup a path518 (e.g., instantiate the path) to the path destination based on thepath parameters.

The PCC (router 510 a) may include additional parameters in the pathcomputation request message (PCRequest). The additional parameters mayor may not override the PCE profile. The additional parameters can beused to selectively augment the centralized profiles (e.g., profiles516). For example, a PCC may send a message that not only includes aprofile identifier but also explicitly specifies a minimum amount ofbandwidth needed through the requested path. The PCE would compute apath using constrains that correspond to the profile identifier as wellas the bandwidth constrain. The PCE may make use of a path policy engine(e.g., policy agent 1316 in FIG. 13B) to determine if these additionalparameters should be considered for a given request. Policy engine canalso enforce additional path computation constraints based on otherinformation available to the PCE (e.g. path database 504, TED database506). Note that the protocol and framework described herein can beapplied in any network that uses a path computation element(s) and hasdistributed state that can trigger the setup of a path (e.g. InternetProtocol(IP)/MPLS networks with RSVP-TE, IP/MPLS networks using segmentrouting TE, networks using Segment Routing with IPv6 trafficencapsulation, etc.). While system 500 is discussed in the context ofthe PCC initiating a path, in some implementations, a PCE may alsoinitiate a path. For example, a PCE may transmit a path initiationmessage to the PCC instructing the PCC to instantiate a path to adifferent destination.

In an implementation, system 500 may comprise both PCE profiles 516 andPCC profiles (not shown), which may be stored on a PCC (e.g., router 510a). For example, the PCC may have a plurality of locally configured PCCprofiles, but doesn't necessarily know which one to apply to the path.In this case, the PCC can place a path computation request including oneor more PCE profile IDs (i.e., the IDs used by the PCE uses to identifythe parameters for path computation). Upon received the path computationrequest, the PCE may use the PCE profile IDs to identify one or more PCCprofile IDs that it should reference in its response to the PCC (e.g.,using a memory that stores a mapping between PCE profile IDs and PCCprofile IDs). The PCE may then generate a path computation reply (e.g.,a PCEP PCRep message) include the identified one or more PCC profileIDs, which references the profiles configured locally on the PCC.

FIG. 6 is a simplified schematic diagram illustrating network supportingPCE-initiated paths, according to an embodiment of the disclosure. Insystem 600, a PCE (e.g., PCE 602) may initiate path creation. Thecomponents in system 600 (FIG. 6) are similar to the components insystem 100 (FIG. 1). A key difference between systems 100 and 600 isthat system 600 comprises PCC profiles 616, stored local to a PCC (e.g.,router 610 a). In one embodiment, PCC profiles 616 are implemented usingthe extension shown in FIGS. 2-4, and/or 22; in such a case, the PCCprofiles 616 corresponds to the profile object 302. PCC profiles 616 mayinclude PCC profile identifiers and corresponding a constraint(s) (e.g.,path usage parameters), which define the profiles. For example, theconstraints can define restrictions on how a path may be utilized. Inthis example, the PCC profiles (IDs and definitions) are stored only onthe PCC and not on the PCE (PCE 602). The PCE only stores the PCCprofile identifiers and not the profile definitions. The PCE may have noinformation regarding the constraints (e.g., the PCC profiledefinitions) that correspond to the profile identifier. Storage of thePCC profile definition on the PCC advantageously allows a centralcontroller (e.g., the PCC or a SDN controller) to initiate paths, whileallowing the central controller to specify (via the PCC profile) how thepath may be utilized. The (distributed) PCCs enforce the constraintsspecified by the PCE.

Another advantage of the systems and methods described herein is thatPCC profile need only be configured (or defined) once (and not more thanonce). After the profile is defined, PCEP messages may reference thecorresponding profile id regardless of the number of paths that use thatprofile. Thus, the profile definition is not duplicated for each paththat uses the profile. Moreover, the amount of storage space requiredfor storing the profiles is independent of the number of paths. Incontrast, if no profile and profile IDs were used, the profiledefinition would be explicitly specified each time a path were createdtherefore duplicating the profile definition multiple times (e.g., foreach path) and consuming more storage space. In the latter case (withoutprofile IDs/explicitly duplicating profiles for each path), the amountof storage space required for storing the profiles increasesproportional to (e.g., increases linearly) the number of paths. Inaddition, the systems and methods described herein allow updating ordeleting a PCC profile in one action regardless of the number of pathsthat are using it.

Using a PCEP extension, a PCE (e.g., PCE 602) may generate a pathinitiation request 614 specifying path parameters, a path destination,and a PCC profile identifier. In an embodiment, the request contains oneor more PCC profile identifiers. Upon receiving the path initiationrequest the PCC sets up a path 618 (e.g., instantiates the path) to thepath destination based on the path parameters. The PCE may send a reportmessage 612 to the PCE indicating the status of the path 618 (e.g., up,down, properly working, not properly working). The PCE (602) mayexplicitly include additional path usage parameters in the pathinitiation request (PCRequest). These extended requests can be used toselectively augment a PCC profile. The additional path usage parametersmay or may not override the PCC profile definition stored on the PCC.Note that this protocol and framework can be used with any network thatuses of a path computation element that can trigger the setup of a path(e.g. Internet Protocol(IP)/MPLS networks with RSVP-TE, Segment Routingnetworks, etc.). While system 600 is discussed in the context of the PCEinitiating a path, in some implementations, a PCC may also initiate apath. For example, a PCC may transmit a path computation request to thePCE instructing the PCE to compute a path.

FIG. 7 is a simplified schematic diagram illustrating network supportingPCC-initiated paths and PCE-initiated paths, according to an embodimentof the disclosure. In system 700, a PCC (e.g., router 710 a) and/or aPCE (e.g., PCE 702) may initiate path creation. The components in system700 (FIG. 7) are similar to the components in systems 500 (FIG. 5) and600 (FIG. 6). A key difference between systems 700, 500 and 600 is thatsystem 700 comprises both PCE profiles 716 and PCC profiles 718, whilesystems 500 and 600 include one of PCE profiles and PCC profiles. In oneembodiment, PCE profiles 716 and PCC profiles 718 are implemented usingthe extension shown in FIGS. 2-4, and/or 22; in such a case, the PCEprofiles 716 and PCC profiles 718 each correspond to the profile object302. The operation of PCE 702 and PCC 710 a and may incorporate elementsof PCE 502 and PCC 610 a, respectively In one embodiment, the featuresprovided for system 500 and 600 are all provided for system 700.

In each of the aforementioned systems (e.g., 500, 600, and 700), theprofile identifiers are opaque identifiers, the semantics of which aredetermined by a system operator. The application of the opaqueidentifiers in computing path and/or managing path utilization providesseparation (via abstraction) between PCEs and PCC thereby proving highlevel of flexibility with respect to implementation of the semantics ofthe profile identifier.

This protocol and framework may extend the application-based model inSoftware Defined Networking (SDN) by allowing service nodes to initiatepath setup based on dynamic network service state, but without requiringany distributed path definition. It allows operators to take advantageof network intelligence (distributed service state) while minimizingoperational complexity (centralized path definition and computation).Existing SDN architectures do NOT address path setup based on networkservices (e.g. per-Virtual Routing and Forwarding (VRF) paths,per-service-instance, per-address-family paths).

PCC-Initiated Paths

FIG. 8 is a simplified schematic diagram illustrating network supportingPCC-initiated paths, according to an embodiment of the disclosure.System 800 comprises PCC 802 and PCE 804. PCC 802 transmits a pathcomputation request message (e.g., a PCEP PCReq message) 806 to PCE 804using an extended PCEP protocol (e.g., the extended PCEP protocol asdescribed herein with respect to FIGS. 2-4, and/or 22). PCRequestmessage 806 includes profile id 10 and profile id 20 (i.e., PCE profileidentifiers) each of which corresponds to at least one path constraint.PCE 804 transmits a reply message (e.g., a PCEP PCRep message) includingpath parameters describing a path (or an explicit path). The pathcomplies with the path constraints that correspond to the profile id 10and profile id 20. PCC 806 may set up a path based on the reply message.

Path constraints may comprise a policy and/or a path computationparameter. The path computation parameters may include, e.g., one ormore of Explicit Route Object (ERO), bandwidth, affinities,administrative group, path characteristics (metric type, hop limit),priorities (setup/hold), symbolic name, record route, a label stack, aninstance of a path template, an amount of available bandwidth, a trafficengineering metric, an Border Gateway Protocol community value, acategory of tagged routes within a Border Gateway Protocol community, anInterior Gateway Protocol (IGP) metric, administrative group, and/or hopcount. A policy may include one or more of a source, a destination, pathcomputation parameter(s) in a PCEP request, time, data in a pathdatabase, data in a TED database, a requirement that two or more pathsare disjoint with respect to one another. In an embodiment, a policy canbe a rule that defines a relationship between any information residingon the PCE or a policy server that the PCE can access.

FIG. 9 illustrates exemplary logic or a method (Logic 900) for enablingcentralized path definition and policy with distributed path setupcontrol for PCC-initiated paths, according to an embodiment of thepresent disclosure. Logic 900 may be implemented (e.g., by a PCC) in asystem where a PCC initiates paths by sending a request message to aPCE. Logic 900 comprises start point 902; receive at least one PCEprofile identifier 904; generate a message requesting a pathcomputation, the message comprising a destination identifier and a PCEprofile identifier 906; transmit the request message to a PCE 908;receive, from the PCE, a reply message comprising a path to thedestination, wherein the path satisfies at least one path constraintcorresponding to the PCE profile identifier 910; and end point 912.

Start point 902 may coincide with a start or end point of other logic,routines, and/or applications. In addition, at start point 902, data(e.g., objects, values, variables, etc.) may be initialized, retrieved,or accessed for use in logic 900.

At procedure 904, at least one PCE profile identifier is received, e.g.,by a PCC. In some embodiments, the at least one PCE profile identifieris provisioned by a profile provisioning system and/or an applicationthat configure the definition of the profiles. Upon receipt, a PCC maystore the at least one PCE profile identifier in a memory accessible bythe PCC. The memory may be included in the PCC or may be external to thePCC.

At procedure 906, a message requesting a path computation (e.g., PCReq)is generated (e.g., by the PCC). The message comprises a destinationidentifier and a PCE profile identifier 906. In some embodiments, themessage may contain a plurality of PCE profile identifiers. The messagemay also explicitly contain a path constraint (e.g., bandwidth) (i.e.,in addition to any implicit reference to a path constraint via a PCEprofile identifier).

The request message is transmitted to a PCE (e.g., by the PCC), atprocedure 908. The request message may be a PCEP Request messagecomprising a PCE profile identifier and a destination identifier (e.g.,message format as shown in FIGS. 2-4, and/or 22).

At procedure 910, a reply message (e.g., a PCEP PCRep message)comprising path parameters describing a path to the destination isreceived, from the PCE. The PCC may use the parameters to setup a path.In an embodiment, the path is a RSVP-TE path or a SR-TE path. The pathsatisfies at least one path constraint corresponding to the PCE profileidentifier, which was sent, e.g., by the PCC to the PCE. If the requestmessage included more than one PCE profile identifier or explicit pathconstraints, then the path (based on the data received in the replymessage) may satisfy more than one path constraint corresponding to themore than one PCE profile identifier and/or the explicit pathconstraints. These extended requests (i.e., including explicit pathconstraints) can be used to selectively augment the centralized PCEprofiles. The PCE may use of a path policy engine to determine if theseadditional parameters should be considered for a given request. Policyengine can also enforce additional path computation contains based onother information available to the PCE (e.g. path database).Advantageously, this protocol and framework can be used with any networkthat uses of a path computation element (PCE) and has distributed statethat can trigger the setup of a path (e.g. Internet Protocol(IP)/MPLSnetworks with RSVP-TE, Segment Routing networks, etc.).

In some embodiments, the PCC has no information regarding the at leastone path constraint corresponding to the PCE profile identifier. Inother words, the parameters used by the PCE for path computation areunknown to the PCC. The PCE profile identifier provides a layer ofabstraction between the definition of a PCE profile and the use of thePCE profile by distributed network components (e.g., PCCs), which mayonly have access to an identifier corresponding to the definition of thePCE profile and not to the definition of the PCE profile.Advantageously, because the PCE profile definition resides in a centrallocation (e.g., at a PCE), the definition of the profile may be updated(e.g., at a PCE) in a single location, without requiring anydistribution of the updated path definition to multiple locations in thenetwork. In one example, the PCE may transmit update messages (e.g., aPCEP Update message) to specific network components (e.g., a subset ofnetwork components), which require updated path parameters and/or policybased on the updated profile.

End point 912 may coincide with a start/end point of other logic,routines, and/or applications (e.g., start point 1702, start point1802). Logic 900 may be implemented in any component or combination ofcomponents of systems 100, 500, and/or 700. For example, a processoroperatively coupled to (or within) a PCC may execute logic 900. In oneimplementation, logic 900 may be provisioned in whole or in part in PCC802 (FIG. 8).

FIG. 10 illustrates exemplary logic (Logic 1000) or a method forenabling centralized path definition and policy with distributed pathsetup control for PCC-initiated paths, according to an embodiment of thepresent disclosure. Logic 1000 provides logic, which may be implementedin a system where a PCC initiates paths by sending a request message toa PCE. Logic 1000 comprises start point 1002; receive at least one PCEprofile identifier and at least one corresponding path constraint 1004;receive, from a PCC, a message requesting a path computation, themessage comprising a destination and a PCE profile identifier 1006;compute path parameters describing a path to the destination based onthe at least one corresponding path constraint for the PCE profileidentifier 1008; generate a reply message comprising the path parametersdescribing the path to the destination 1010; and end point 1012.

Start point 1002 may coincide with a start or end point of other logic,routines, and/or applications. In addition, at start point 1002, data(e.g., objects, values, variables, etc.) may be initialized, retrieved,or accessed for use in logic 1000.

At procedure 1004, at least one PCE profile identifier and at least onecorresponding path constraint is received (e.g., by a PCE). In someembodiments, the at least one PCE profile identifier and the at leastone corresponding path constraint are provisioned by a profileprovisioning system and/or an application that configures the definitionof the PCE profiles. Upon receipt, a PCE may store the at least one PCEprofile identifier in a memory accessible by the PCE. The memory may beincluded in the PCE or may be external to the PCE.

A message requesting a path computation (PCReq) is received (e.g., bythe PCE) from a PCC, at procedure 1006. The message comprises adestination and a PCE profile identifier. In one implementation, themessage may contain one or more profile identifiers. In one example, thePCE may identify path constraints corresponding to the PCE profileidentifier and/or the destination. A PCE may query a path profiledatabase (e.g., an path database; TED database; databases 104, 106, 504,and/or 506; etc.) and apply any policies and/or path computationparameters associated with the PCE profile. The message requesting apath computation may be generated by the PCC in response to a networkstate that is local to the PCC. The message requesting the pathcomputation may be an extension of a PCEP Request (PCReq) message (e.g.,using the extension of PCEP as described herein with respect to FIGS.2-4 and/or 22). In an implementation, the message requesting the pathcomputation explicitly includes one or more path constraints (e.g., inaddition to the profile id and destination, the message may include aminimum latency value for the path and/or other path computationparameter, policies, etc.). The explicitly included one or more pathconstraints may or may augment the profile definition corresponding tothe profile id. In some examples, the explicitly included one or morepath constraints may or may not override the profile definitioncorresponding to the profile.

In some embodiments, PCE has no information regarding the network statethat is local to the PCC. In other words, there exists a network statelocal to the PCC that is not accessible the PCE, or is too costly toaccess. Thus, the PCC may make a decision, based on a state local to thePCC, to request path generation without prompting by the PCE.

At procedure 1008, path parameters (or path description parameters)describing a path to the destination is computed (e.g., by the PCE)based on the at least one corresponding path constraint for the PCEprofile identifier. A reply message (e.g., a PCEP PCRep message)comprising the path parameters for the path is generated (e.g., by thePCE) at procedure 1010. In one example, the reply message is a PCEP pathcomputation reply message that is transmitted from a PCE to a PCC. ThePCC may use the parameters to setup a path. In an embodiment, the pathis a RSVP-TE path or a SR-TE path.

A path constraint may comprise a policy and/or a path computationparameter. A path computation parameter may include, e.g., one or moreof Explicit Route Object (ERO), bandwidth, affinities, administrativegroup, path characteristics (metric type, hop limit), priorities(setup/hold), symbolic name, record route, a label stack, an instance ofa path template, an amount of available bandwidth, a traffic engineeringmetric, an Border Gateway Protocol community value, a category of taggedroutes within a Border Gateway Protocol community, an Interior GatewayProtocol (IGP) metric, administrative group, and/or hop count. A policymay include one or more of a source, a destination, a path computationparameter in a PCEP request, time, data in a path database, data in aTED database, a requirement that two or more paths are disjoint withrespect to one another.

End point 1012 may coincide with a start/end point of other logic,routines, and/or applications (e.g., start point 1702, start point1802). Logic 1000 may be implemented in any component or combination ofcomponents of systems 100, 500, and/or 700. A processor operativelycoupled to (or within) a PCE may execute logic 1000. In oneimplementation, logic 1000 may be provisioned in whole or in part in PCE803 (FIG. 8).

FIG. 11 is a table illustrating exemplary definitions for PCE profiles,according to an embodiment of the present disclosure. The first columnlists the PCE profile identifiers and the second column corresponds tothe definition of the PCE profiles. Each PCE profile identifier maycorrespond to at least one policy and/or path constrain. In thisexample, each PCE profile identifier corresponds to more than one leastone policy and/or path constrain. The PCC profile identifiers in FIG. 11may also correspond to a single policy and/or path constrain (though notshown). At least a portion of the data illustrated in the table may bestored in a memory for access by a PCE and/or a PCE.

Example Applications of PCC Initiated Paths

A first example application includes automatic tunnel mesh driven bynetwork services. Assume a network with 100 Provider Edge (PE) devicesthat provide public IP, private IP and private multi-point Ethernet(E-LAN) services. Each of these services has unique traffic engineeringrequirements, so separate meshes of TE (RSVP-TE or Segment Routing)paths need to be created for specific service prefixes between serviceend points. Each PE can use a given BGP community value when advertisingprefixes of interest for a particular service:

-   -   IPv4<->Community-value1    -   VPNv4<->Community-value2    -   VPLS<->Community-value3

For example, FIGS. 12A and 12B are simplified schematic diagramsillustrating an exemplary system and workflow for enabling generating apath based on a policy local to a PCC, according to an embodiment of thepresent disclosure. Each community corresponds to a path profile, asdefined by local policy 1208. An ingress PE 1202 receives theadvertisement and checks whether a path has been established to theegress PE 1216 with the required path profile. If not, it transmits apath computation request 1210 to PCE 1204 asking for a path to theegress PE 1216 for the profile 1206 identified in the local policy 1208for the community. Once a path computation reply 1212 is received, thepath is setup (e.g., established, generated, or signaled (only signaledif RSVP-TE is required), etc.) and the service prefixes are associatedwith the received path. In one example, the path is a RSVP-TE path or aSR-TE path. The PCC may transmit a report to the PCE (e.g., using PCEPto delegate control). Note that an operator of system 1200 may allowcustomers or peers to dynamically signal service prefixes that requirepaths of certain profiles, e.g., using BGP communities over an eBGPpeering with the network.

Note that in the first example application, if a distributed pathdefinition approach is used, each PE ends up with 99×3=297 path (tunnel)definitions for a total of 29,700 network wide. If distributed pathprofiles (tunnel templates) are used, each PE ends up with 3 locallydefined profiles, which are replicated across all PEs (300 profiledefinitions in the network). With centralized profiles, the PCE onlymaintains a single copy of the 3 path profiles.

A second example application includes distributed denial of service(DDoS) protection using BGP Flowspec and path profiles. A BGP Flowspecrule can be injected at an egress LSR with a specific community. Wheningress LSRs receives the Flowspec entry, it is processed as usual andthe community value is used to identify a path profile. A pathcomputation request is placed to a PCE indicating the path profile andthe destination desired (whether redirection is need or not). No BGPFlowspec extensions are required. Once a path computation reply isreceived the path is setup (e.g., generated, instantiated, signaled ifRSVP-TE is required, etc.) and the traffic matching the Flowspec isinjected in the received path.

A third example application includes generating fully disjoint paths(e.g., TE LSPs and/or SR-TE paths). For example, FIGS. 13A and 13B aresimplified schematic diagrams illustrating network architecture aworkflow for establishing fully disjoint paths, according to anembodiment of the present disclosure. System 1300, as illustrated inFIGS. 13A and B, includes two PCCs (i.e., PCC1, 1302 and PCC2, 1304),which independently submit path computation requests to the PCE 1306 fordisjoint paths. First, PCC1 1302 submits to the PCE, path computationrequest 1310, which includes profile IDs 10 and 20 (i.e., 1308 and 1314,in FIG. 13A) and a destination. The path computation request may alsoexplicitly include additional path constraints (e.g., bandwidth, andpriority). In this example, profile ID 10 corresponds to a policy ofdisjointness between paths, and profile ID 20 corresponds to a serviceinstance (e.g., an instance of the disjointness policy associated with aparticular network service). One profile ID (in this case 20) may beused as a parameter (or argument value) associated with another profileID (in this case 10). In this example, profile ID 20 (e.g., theparameter) is interpreted by PCE 1306 within the context of 10. Inaddition, a path (e.g., Path A) returned from PCE 1306 to request 1310may also satisfy the additional path constraints (e.g., for bandwidthand priority based on those included in request 1310). Later, PCC2 1304submits to the PCE, path computation request 1322 also specifyingprofiles 10 and 20. Path computation request 1322 also explicitlyincludes additional path constraints (e.g., bandwidth, and priority). Inthis example, since both requests correspond to the same disjointinstance (i.e., 20), the path computed for PCC2 must be disjoint fromall existing paths for disjoint instance 20 (i.e., must be disjoint fromPath A). The PCE may know about the existence of Path A based on adatabase entry associated with Path A. PCE 1306 generates a path (i.e.,Path B), and transmit the path to PCC2 1304 in a PCEP reply message. Inaddition to Path B being disjoint from Path A, Path B may also satisfythe additional path constraints (e.g., for bandwidth and priority basedon those included in request 1312). Note that the bandwidth and priorityincluded in request 1312 may be different from the bandwidth andpriority included in request 1310.

The PCCs may not know about one another and may not know whether anypaths exist for the requested profiles (i.e., policies). To resolve eachrequest, the PCE 1306 may communicate with policy agent 1316 (e.g.,sending messages 1318 and 1324 to the police agent) to determine whetherthe PCC's requests satisfy the policy. The application of the policy, bypolicy agent 1316, may return a Boolean value indicating whether anaction is allowed given a current state of the network (e.g., by sendingmessages 1320 and 1326 to the PCE). In the example of a disjoint policy,the Boolean value indicates whether a path may be initiated (i.e.,action) in the network that does not overlap with an existing path(i.e., current state) in the network. The PCEP messages (e.g., 1310,1312, 1322, and 1328) may be generated using an extension of a PCEP(e.g., using the extension of PCEP as described herein with respect toFIGS. 2-4, and/or 22).

In this case, the PCE is a stateful PCE storing state information forexisting paths that were generated by the PCE. For example the PCE maymaintain a database of existing paths in the network. The stateinformation can include paths and corresponding profile identifiersassociated with the paths. For example, a path that was generated basedon profile identifier 10, would be stored in the database with anassociation to profile identifier 10.

Whenever a network service requires fully disjoint paths, LSP head ends(acting as Path Computation Clients (PCCs)) can use one or more of theprofile IDs (e.g., in this case profile id 20) as a service identifierthat a stateful PCE can use to enforce a policy of full disjointnessbetween paths associated with the id. This is approach to achievingdisjoint paths with stateful PCE while letting PCCs initiate path setupmay be advantageously applied to transport of signaling traffic (e.g.,signaling transport (SIGTRAN)) and transport of market data in financialmarkets. Other mechanisms fail to achieve disjoint paths with statefulPCE while allowing PCCs initiate path setup.

Policies are not limited to disjoint policies. A policy may include oneor more of the following: source address, destination address, pathcomputation parameters in a PCEP request, time, data in a databasecontaining path information, data in a path database, data in a TEDdatabase, or any other information available locally or remotely to thePCE. Policies may use an array of parameters as input. In someembodiments, the PCE may act as a policy enforcement point (PEP). ThePCE may use a profile id to identify a policy enhancing pathcomputation.

A fourth example application includes handling changes to centralizedpath computation via policy advantageously through the systems andmethods described herein. For an active stateful PCE (e.g., SoftwareDefined Network (SDN) model), the PE devices delegate control to thePCE. Therefore, changes made to path definition and policy can beimmediately acted upon by the PCE and communicated to PE devices using aPCEP PCUpd message (i.e., an update message). In the case of a statelessPCE or passive stateful PCE, the changes will take effect on the PEdevices during the next computation request. Reoptimization timers,topology changes, or operator action can trigger the changes.

PCE-Initiated Paths

FIG. 14 is a simplified schematic diagram illustrating networksupporting PCE-initiated paths, according to an embodiment of thedisclosure. System 1400 comprises PCC 1402 to PCE 1404. PCE 1404transmits PCInitiate message 1406 to PCC 1402. PCInitiate message 1406includes profile id 10 and profile id 20 (i.e., PCC profile identifiers)each of which corresponds to a path usage parameter. The PCC may set upa path based on the PCInitiate. All utilization of the path must satisfythe path usage parameter specified in the PC initiate message.Subsequent to the initiate message the PCE transmits an update message(e.g., a PCEP PCUpd message) 1408 to the PCC to communicate updatedprofiles to the PCC (e.g., profiles corresponding to a path). A pathupdate message may include at least one of an updated path parameterdescribing the path from the PCC to the path destination (e.g., if thepath it self has changed) and/or an updated profile identifier (e.g., ifthe usage parameters for a path(s) has changed). Based on the updatedprofiles, any subsequent utilization of the path must satisfy theupdated path usage parameters corresponding to the updated profiles.

In an implementation, each of the PCInitiate message and the updatemessage may comprise a profile object and/or one or more profile IDs(e.g., using the extension of PCEP as described herein with respect toFIGS. 2-4, and/or 22).

A path usage parameter may comprise one or more of a auto-bandwidth, abackup bandwidth, Bidirectional Forwarding Detection (BFD), forwardingadjacency, load share, event logging, a quality of service (QoS) policy,an IGP shortcut, an instruction specifying that the path should be usedin a shortest path calculation, requiring use of a targeted LabelDistribution Protocol, requiring use of a Bidirectional ForwardingDetection protocol, a local variable on the router indicating a coloringof a tunnel for forwarding, automatic bandwidth collection, automaticbandwidth adjustment, length of a window of time in which the averagetraffic going over the tunnel is computed, traffic accounting parameter,IP address, a maximum transmission unit, a policing function, etc.

FIG. 15 illustrates exemplary logic or a method (Logic 1500) forcentralized path setup control with distributed path utilizationconstraints for PCE-initiated paths, according to an embodiment of thepresent disclosure. Logic 1500 may be implemented in a system where aPCE initiates paths by sending a path initiation message to a PCC. Logic1500 comprises start point 1502; receive at least one PCC profileidentifier and at least one corresponding path usage parameter 1504;receive, from a PCE, an initiate message comprising path parameters, apath destination, and a PCC profile identifier 1506; setup a path basedon the path parameters, wherein utilization of the path conforms to theat least one past usage parameter corresponding to the profileidentifier associated with the path 1508; and end point 1510.

Start point 1502 may coincide with a start or end point of other logic,routines, and/or applications. In addition, at start point 1502, data(e.g., objects, values, variables, etc.) may be initialized, retrieved,or accessed for use in logic 1500.

At procedure 1504 at least one PCC profile identifier and at least onecorresponding path usage parameter is received (e.g., by a PCC). In someembodiments, the at least one PCC profile identifier and the at leastone corresponding path usage parameter is provisioned by a profileprovisioning system and/or an application that configures the definitionof the profiles. Upon receipt, a PCC may store the at least one PCCprofile identifier and the at least one corresponding path usageparameter in a memory accessible by the PCC. The memory may be includedin the PCC or may be external to the PCC.

At procedure 1506, an initiate message comprising path parameters, apath destination, and a PCC profile identifier is received (e.g., by aPCC) from a PCE. In some embodiments, the initiate message may includeone or more PCC profile identifiers and/or one or more explicitly statedpath usage parameters. The initiate message may be an extension of aPCEP PCInitiate message (e.g., using the extension of PCEP as describedherein with respect to FIGS. 2-4, and/or 22).

At procedure 1508, a path is setup (e.g., established or instantiated)(e.g., by a PCC) based on the path parameters. Utilization of the pathconforms to the at least one past usage parameter corresponding to thePCC profile identifier associated with the path. In one example, a PCC(e.g., the PCC that setup the path) may enforce the utilization of thepath to satisfy the at least one past usage parameter. For example thePCC may block or reroute any traffic on the path that does not satisfythe at least one past usage parameter. In addition, if the initiatemessage included any additional PCC profile identifier and/or anexplicit reference to a path usage parameter, the utilization of thepath also conforms to at least one past usage parameter corresponding tothe additional PCC profile identifier and/or the explicitly referencedpath usage parameter.

End point 1510 may coincide with a start/end point of other logic,routines, and/or applications (e.g., start point 902, start point 1002).Logic 1500 may be implemented in any component or combination ofcomponents of systems 100, 600, and/or 700. A processor operativelycoupled to (or within) a PCE may execute logic 1500. In oneimplementation, logic 1000 may be provisioned in whole or in part in PCC1402 (FIG. 14).

FIG. 16 illustrates exemplary logic or a method (Logic 1600) forenabling centralized path setup control with distributed pathutilization constraints for PCE-initiated paths, according to anembodiment of the present disclosure. Logic 1600 may be implemented in asystem where a PCE initiates paths by sending a path initiation messageto a PCC. Logic 1600 comprises start point 1602; receive at least onePCC profile identifier 1604; compute path parameters describing a passfrom a PCC to a path destination 1606; generate a path initiationmessage comprising the path parameters, the path destination, and a PCCprofile identifier, wherein the path initiation message is generated inresponse to receiving a path computation request 1608; transmit the pastinitiation message to the PCC 1610; and end point 1612.

Start point 1602 may coincide with a start or end point of other logic,routines, and/or applications. In addition, at start point 1602, data(e.g., objects, values, variables, etc.) may be initialized, retrieved,or accessed for use in logic 1600.

Procedure 1604, at least one PCC profile identifier is received, e.g.,by a PCE. In some embodiments, the at least one PCC profile identifieris provisioned by a profile provisioning system and/or an applicationthat configures the definition of the profiles. Upon receipt, a PCE maystore the at least one PCC profile identifier in a memory accessible bythe PCE. The memory may be included in the PCE or may be external to thePCE.

At procedure 1606, path parameters describing a path from a PCC to apath destination are computed (e.g., by a PCE).

A path initiation message is generated (e.g., by a PCE) at procedure1608. The path initiation message comprises the path parameters, thepath destination, and a PCC profile identifier. In some examples, thepath initiation message contains one or more PCC profile identifiers. Inaddition, the path initiation message is generated in response toreceiving a path computation request. In an embodiment, the pathcomputation request is not received from a router acting as a PCC. Thepath computation request may be received from an object local to the PCE(e.g., within the PCE) or may be received remotely from an externalcomponent (e.g., an application). For example, path computation requestmay be received from an application that uses an interface of acontroller (e.g., a northbound interface of an SDN controller) toinstruct the PCE to create a path in the network. The path initiationmessage is transmitted to a PCC at procedure 1610. In an embodiment, theinitiate message may be an extension of a PCEP PCInitiate message (e.g.,using the extension of PCEP as described herein with respect to FIGS.2-4, and/or 22).

End point 1612 may coincide with a start/end point of other logic,routines, and/or applications (e.g., start point 902, start point 1002).Logic 1600 may be implemented in any component or combination ofcomponents of systems 100, 600, and/or 700. A processor operativelycoupled to (or within) a PCE may execute logic 1600. In oneimplementation, logic 1000 may be provisioned in whole or in part in PCE1404 (FIG. 14).

Example Applications of PCE-Initiated Paths

FIGS. 17A and 17B are simplified schematic diagrams illustrating anexemplary system and workflow for implementing a network service,according to an embodiment of the present disclosure. System 1700comprises elements similar to those in system 600. A key difference fromsystem 600 is that system 1700 includes application 1702, which managesPCC profile instantiation, path instantiation, and service instantiationfor an Ethernet Private Line (E-LINE) service. Although the application1702 manages initiation of the paths, profiles, and services, the PCEperforms the initiations (e.g., based on a requests received from of theapplication). As shown in FIG. 17B, Application 1702 manages PCC profileinstantiation, path instantiation, and service instantiation. Theapplication 1702 transmits, to PCC 1706, configuration message 1708providing a PCC profile identifier and a definition of the PCC profile.The definition of the PCC profile may include at least one path usageparameter corresponding to the PCC profile identifier. PCC 1706 maystore the PCC profile in a memory element accessible by the PCC. Theconfiguration message may be a transmitted via Network ConfigurationProtocol (Netconf), YANG data model, and/or a command line interface(CLI). To manage path instantiation, the application 1702 transmits tothe PCE, path request message 1710, which specifies PCC profileidentifier 10. In some implementation, path request message 1710 maycomprise one or more PCC profile identifiers. The path request messagemay be transmitted utilizing a HTTP GET, a representational statetransfer (REST) call, a Java message, etc. In response to receiving pathrequest message 1710, PCE 1704 may transmit to PCC 1706 a pathinitiation request 1712 including the PCC profile identifier(s) receivedfrom application 1702. Path initiation request 1712 may be a PCEPmessage (e.g., an extended PCEP message as in FIGS. 2-4, and/or 22). Inresponse to receiving the path initiation request, the PCC may setup thepath (e.g., establish or instantiate the path). In some embodiment, uponsetting up the path, PCC 1706 may store an association between theprofile ID and the path. PCC 1706 may ensure that any use of the pathsatisfies the path usage parameters that correspond to the profile IDassociated with the path. PCC 1706 transmits to PCE 1704 path reportmessage 1714 including a status of the path setup by the PCE. Inresponse to receiving the path report message, PCE 1704 transmits to theapplication 1702 path reply message 1716 including an identifier for thepath and the status of the path.

To manage service instantiation, the application 1702 transmits to PCC1706 a service configuration message 1718 including the identifier forthe path. In response, the PCC may generate a service class using theidentifier for the path based on the configuration request received fromthe application. Finally, the application 1702 transmits to the PCC,instantiation requests 1720 and 1722. In response instantiationrequests, the PCC generates services based on the previously definedservice class.

FIGS. 18A and 18B are tables illustrating exemplary definitions for PCCprofiles, according to one or more embodiments of the presentdisclosure. In both tables, the first column (i.e., column labeled “PCCPROFILE IDENTIFIER”) lists PCC profile identifiers and the second column(i.e., column labeled “PROFILE DEFINITION”) corresponds to thedefinition of the PCC profiles using one or more path usage parameters.In FIG. 18A, each PCC profile identifier corresponds to only one pathusage parameter, which defines the profile. In FIG. 18B, each PCCprofile identifier corresponds to more than one path usage parameter.The PCC profile identifiers in FIG. 18B may also correspond to a singlepath usage parameter (though not shown). Each PCE profile identifier maycorrespond to at least one path usage parameter. Advantageously, thechoice of whether to associate profile IDs with a single path usageparameter or a plurality of usage constraints allows a network operatorflexibility of predefining specific combinations of path usageparameters (FIG. 18A) or allowing maximum flexibility to mix and matchvarious path usage parameters, as needed (FIG. 18B). At least a portionof the data illustrated in the table may be stored in a memory foraccess by a PCE and/or a PCE.

Other Example Applications

Several embodiments of the present disclosure relate to using profileidentifiers that correspond to a profile definition, which can bedefined by an attribute and a value of the attribute (e.g., attribute:Bandwidth; value: 100 Mbps). In other embodiments, the profileidentifiers can correspond to a profile definition that is onlypartially defined. For example, a partially defined profile may includean attribute (e.g., a constraint, a path usage parameter, a policy, apath computation parameter) but may not include a specific value of theattribute. Any device or component that utilizes the profile identifierof the profile, must provide the value (e.g., a parameter or argumentvalue) as an input to the attribute or constraint. An exemplary use ofsuch a profile includes, e.g., systems where a range of values or alarge set of specific values is acceptable for an attribute. Thefollowing table provide non-limiting examples of partially definedprofiles:

PCC Profile PCE Profile Profile 10: BFD interval <A>, Profile 50:Bandwidth <A> multiplier <B> Profile 20: Autoroute announce Profile 60:Priority setup <B>, hold <C> Profile 30: Autoroute destination Profile70: Metric TE, Profile 80 ipv6 <C> Profile 40: Forwarding class <D>Profile 80: Disjoint service <D>

The above table shows profiles that include profile identifiers,attributes and parameters, i.e., in the format profile identifier:attribute<parameter>. As shown above a profile may include one or morepairs of attributes and corresponding parameters (argument values). Inother examples, each attribute may require one or more parameters asinput. For example, a profile identifier may correspond to profiledefinition of Latency, and the parameters may correspond to minimum andmaximum values of latency. Other examples include using a parameter thatdoes not relate to a measureable value but may be an arbitrarily definednumber (e.g., a service identifier). For example, a network service maybe assigned the number 200. A disjointness request for a path of thenetwork service (e.g., using profile 80 in the above table) may comprisea path computation request including the profile identifier and thenumber assigned to the service (e.g., 80, 200). Thus, many services areenabled to utilize the same profile but may specify different numbers(corresponding to different services) in the request. In other examples,a profile identifier may be used as a parameter for a profile. Forexample, profile 70 in the above table requires both Metric TE andprofile 80 are satisfied. Any reference to profile 70 also results in areference to profile 80, which requires input of a service identifier.Thus a message utilizing profile 70 may contain the list (70, 80, 200),where 200 is the service identifier. In this example, not only thecontent but also the order of the values in the message encodesimportant information about a relationship between the elements in themessage (e.g., that 200 is an argument for input to 80, and that 80 isan input to 70).

In some embodiments, a profile object (e.g., profile object 300, FIG. 3)may contain values (e.g., parameters, argument values) encoded as one ormore profile IDs. Moreover, the values may be numerical values that canbe directly used (i.e., in a raw, unprocessed fashion) as argumentsassociated with profile IDs. For example, after the value (e.g., thevalue may be 20) is parsed from the profile object, the value may bedirectly used as input for a partially defined profile. In anembodiment, the value may not be used to identify to a profile and isonly used as input to an already identified profile. Although the valuesare numerical values that can be used directly used as arguments, thevalues (i.e., numerical values) may be encoded as one or more profileIDs (from the perspective of the extended protocol described herein).

In addition, several embodiments of the present disclosure relate tousing messages (e.g., PCEP messages) containing one or more profileidentifiers to (implicitly) communicate constraints (i.e., constraintsthat are not explicitly included in a PCEP message). However, whenreferencing partially defined profiles, a message may contain a profileidentifier in combination with one ore more parameters or argumentvalues associated with the profile identifier. For example, a profileidentifier may correspond to profile definition of Latency, and thearguments may correspond to a 10 ms minimum and a 20 ms maximum valuefor latency. The units, in this case milliseconds may or may not beexplicitly included in a message. If the units are not explicitlyincluded in the message, then the peers (e.g., a PCE and a PCC) canagree on the units, in which to send the value, prior to sending themessage.

In some embodiments, an order of components (e.g., profile identifiers,argument values) in a message (e.g., a PCEP message) and/or profiledefinition may be used to specify a relationship the components. Forexample, an order of one or more profile identifiers may be used tospecify a relationship between the profile identifiers. For example, aPCEP message may contain one or more profile identifiers, where theorder of the profile identifiers specifies that a second profileidentifier in the message is argument to a first profile identifier. Inan ordered data structure, the first profile identifier may come beforethe second profile identifier. The first profile ID may be the first inthe order and the second profile id may be second in the order. Thesyntax and/or semantics of profile IDs are independent of PCEP protocoland may be, e.g., controlled by a system operator. Thus, the systemoperator may decide any way to represent the syntax and semantics of theprofile IDs. For example, multiple profile IDs contained in a singleprofile object may be used to represent an unordered collection (e.g., aset) or an ordered collection (e.g., a list). In an unorderedcollection, the order of the elements (e.g., profile IDs and/or argumentvalues) or duplicate elements within the collection may be ignored. Forexample, an unordered set containing the values 10 and 20 may berepresented as {10, 20}={20, 10}={10, 20, 20, 10}. Thus, allcombinations and permutations of the values 10 and 20 are equal to oneanother. In an ordered list, the order of the elements in the collectionmay represent a relationship between the elements, thus the order maynot be ignored. For example, an ordered list containing values 10 and 20may be represented as (10, 20)≠(20, 10)≠(10, 20, 20, 10). Thus, allcombinations and permutations of the profiles IDs 10 and 20 are notequal to one another. An ordered collection of elements (e.g., profileIDs and parameters to the profile ID in a PCEP message) may be used toadvantageously implement parameterized functions and/or hierarchies witharbitrary breadth and width.

In one example, a first network element for transmitting the orderedlist and a second network element for receiving the order list bothaccess data describing the syntax and/or semantics of each of aplurality of profile IDs in a profile object (e.g., each network elementmay access a same instance or separate instances of the data). Thetransmitter (i.e., the first network element) may generate the orderedlist based on the data. The receiver (i.e., the second network element)may parse the elements of the order collection based on the data. Insome examples, the parsing may include using the data to identify, fromthe elements in the ordered list, profile IDs and corresponding argumentvalues associated with to the profile IDs. The receiver may identifyprofiles based on the parsing. In addition, the receiver may act uponthe identified profiles (e.g., by computing a path based on identifiedprofiles and argument values associated with the identified profiles, orby setting up a path based on identified profiles and argument valuesassociated with the identified profiles).

FIG. 19 is a simplified schematic diagram illustrating messagesgenerated by a system for PCC-initiated paths, according to anembodiment of the disclosure. System 1900 comprises PCC 1902 and PCE1904. PCE 1904 may receive (e.g., from a profile provisioning system)one or more partially defined PCE profiles. In an embodiment, PCE 1904may receive one or more ordered lists each comprising a profileidentifier and at least one attribute associated with the profileidentifier. A partially defined profile may be stored as an orderedlist. PCE 1904 may store, in a memory accessible by a PCE 1904, the oneor more ordered lists. In one example, the profile identifier and the atleast one attribute are provided in a particular order in the orderedlist. The particular order of the list may be predetermined e.g., basedon a hierarchical relationship between the profile identifier and the atleast one attribute. For example, in the hierarchical relationship, theprofile identifier may be a parent node of a plurality of nodes in atree data structure and the at least one attribute may be a child nodeof the plurality of nodes in the tree data structure. The tree datastructure may be a binary tree (e.g., where each node has no more than 2child nodes) or an n-nary tree (e.g., where each node has no more than nchild nodes). In other examples, each node may have only one child. Inan implementation, the particular order of the ordered list cancorrespond to an order of nodes encountered in a depth-first traversalof a plurality of nodes in a tree data structure.

PCC 1902 transmits a path computation request message (e.g., a PCReq)1906 to PCE 1904 using an extended PCEP protocol (e.g., the extendedPCEP protocol as described herein with respect to FIGS. 2-4, and/or 22).System 1900 is similar to system 800. A key difference between systems1900 and 800 is that, in contrast to system 800, path computationrequest message 1906, in system 1900, the path computation requestmessage comprises an ordered list of one or more profile IDs (e.g., PCEprofile IDs) and one or more argument values. In some examples, PCC 1902may the request message in response to detecting a network state that islocal to the PCC. The message transmitted (e.g., the path computationrequest message) by PCC 1902 to PCE 1094 may cause PCE 1904 to executean action. The action many be executed in response to determining thatthe order in the message corresponds to a particular order of a profileidentifier and at least one attribute associated with the profileidentifier stored on the second network element. PCE 1904 receives thepath computation request message, from the PCC, comprising an orderedlist of one or more profile identifiers (e.g., PCE profile IDs) and oneor more argument values. Each of the one or more argument values may beassociated with a profile identifier in the one or more profileidentifiers. PCE 1904 may determine whether the one or more profileidentifiers in the message are equal to a profile identifier stored inmemory (i.e., for which the PCE has a profile definition). In responseto determining that the at least one profile identifier in the messageis equal to the profile identifier, PCE 1904 processes the message toidentify the at least one argument value based on the particular orderin the ordered list. PCEP 1904 may execute an action based on the atleast one argument value identified in the processing. The action may beone or more of verifying the validity of the argument value, generatinga path reply message based on the argument value, etc. PCE 1904 maygenerate a reply message (e.g., path reply message 1908) including pathparameters that describe a path. The path may be a path from the PCE toa destination. The path satisfies the profile IDs and the argumentvalues for the profile IDs that were sent to the PCE form the PCC. Thepath parameters may be generated based the one or more profileidentifiers and the one or more argument values. For example, the pathparameters may specify a bandwidth value that was retrieved (e.g.,copied, translated) from argument values. The PCE executed the action togenerate a PCEP path computation reply message, to generate the pathparameters based on the argument vales, etc.

In some embodiments, the PCE profiles (e.g., IDs and definition) may besolely stored on the PCE (e.g., and not accessibly by the PCC). In otherexamples, the PCE profiles (e.g., IDs and definition) may be accessibleby the PCC. In one implementation, the one or more argument values maybe stored in a portion of a PCEP message that is typically used forprofile identifiers (e.g., a profile identifier field within a ProfileID TLV, or in an extended profile id field within a Profile ID TLV).Thus, from the perspective of the PCEP message, an argument value may beencoded as (and appear to be a profile ID). Because the extended PCEPmessages for profiled IDs (disclosed herein) allow end users (e.g.,system operators) to define the semantics of profile IDs in a PCEPmessage, the PCEP message may be used to carry an argument value withina field designated for a profile ID.

In an embodiment, the order of an ordered list (e.g., an ordered list ofProfile IDs and argument values and/or an ordered list of Profile IDSand attributes) may be predetermined, e.g. by a provisioning systemprior to providing the profiles to the PCE. The order may indicate aparticular order in which the profile identifiers and the attributesshould be received (e.g., when received from a PCC). An attribute mayinclude an abstract constraint for which a value is required toimplement the constraint. For example, Latency (or min. Latency) may beused as an attribute and may be implemented with a specific value forlatency (e.g., 5 ms). In one example, an attribute may correspond to aprofile (e.g., reference by its profile ID) configured to acceptparameters and/or argument values as input to the profile. As anotherexample, an ordered list may contain profile id (e.g., profile id 10)and attributes (e.g., BFD interval, multiplier), where a particularorder is (profile id 10, BFD interval, multiplier). In another example,a different particular order may be (profile id 10, multiplier, BFDinterval). In these examples the following orders are not equal to oneanother (profile id 10, multiplier, BFD interval)≠(profile id 10,multiplier, BFD interval). When the PCE receives a message (e.g., a pathcomputation request message) containing a profile identifier, the PCEmay use the memory to identify a profile corresponding to the profileID. The profile contains the specific order of one or more profileidentifiers and the at least one attribute. Using the order retrievedfrom the memory, the PCE can identify the argument that corresponds tothe attribute (since the value of arguments in the message should be inthe order (with respect to the profile ID) retrieved from the memory. Inother words, a profile identifier and corresponding argument value maybe provided in the message in an order that matches (or corresponds to)a particular order of a profile identifier and an attribute in theordered list (i.e., stored in the memory). The PCE may further identifythe location of the argument value in the message based on the locationof the attribute in the profile. The PCE is able to use the order of thepairs of attributes and parameters stored within the profile definitionto identify the argument values in a request message. For example, theprofile definition may have the following order (profile ID, attribute1,attribute2). In this example, when the PCE identifies the profile ID ina request message, it can use the value that immediately follows theprofile ID as the argument values for attribute1, and the nextconsecutive value as the argument value for attribute2.

In an implementation, PCE 1904 may implement logic 1000, in addition toor in combination with the above described logic. PCC 1902 may implementlogic 900, in addition to or in combination with the above describedlogic. The components and logic of system 1900 may be implemented asdescribed with respect to FIGS. 8, 9 and 10.

FIG. 20 is a simplified schematic diagram illustrating messagesgenerated by a system for PCE-initiated paths, according to anembodiment of the disclosure. System 2000 comprises PCC 2002 and PCE2004. PCC 2002 may receive (e.g., from a profile provisioning system)one or more partially defined PCC profiles. In an embodiment, PCC 2002may receive one or more ordered lists each comprising a profileidentifier and at least one attribute associated with the profileidentifier. A partially defined profile (e.g., a PCC profile) may bestored as an ordered list. PCC 2002 may store, in a memory accessible bya PCC 2002, the one or more ordered lists. In one example, the profileidentifier and the at least one attribute are provided in a particularorder in the ordered list. The particular order of the list may bepredetermined e.g., based on a hierarchical relationship between theprofile identifier and the at least one attribute. For example, in thehierarchical relationship the profile identifier may be a parent node ofa plurality of nodes in a tree data structure and the at least oneattribute may be a child node of the plurality of nodes in the tree datastructure. The tree data structure may be a binary tree (e.g., whereeach node has no more than 2 child nodes) or an u-nary tree (e.g., whereeach node has no more than n child nodes). In other examples, each nodemay have only one child. In an implementation, the particular order ofthe ordered list can correspond to an order of nodes encountered in adepth-first traversal of a plurality of nodes in a tree data structure.

PCE 2004 transmits a path initiation message (e.g., a PCInitiate) 2006to PCC 2002 using an extended PCEP protocol (e.g., the extended PCEPprotocol as described herein with respect to FIGS. 2-4, and/or 22).System 2000 is similar to system 1400. A key difference between systems2000 and 1400 is that, in contrast to system 1400, path initiationmessage 2006, in system 2000, comprises an ordered set of one or morePCE Profile IDs and one of more argument values. The message transmitted(e.g., the path initiate message) by PCE 2004 to PCC 2002 may cause PCE2002 to execute an action in response to determining that the order inthe message corresponds to a particular order of a profile identifierand at least one attribute associated with the profile identifier storedon the second network element. PCC 2002 receives the path initiationmessage, from PCE 2004, comprising an ordered list of one or moreprofile identifiers (e.g., PCE profile IDs) and one or more argumentvalues. Each of the one or more argument values may be associated with aprofile identifier in the one or more profile identifiers. PCC 2002 maydetermine whether the one or more profile identifiers in the message areequal to a profile identifier stored in memory (i.e., using profiles forwhich the PCC has a profile definition). In response to determining thatthe at least one profile identifier in the message is equal to theprofile identifier, PCC 2002 processes the message to identify the atleast one argument value based on the particular order in the orderedlist. PCC 2002 may execute an action based on the at least one argumentvalue identified in the processing. The action may be one or more ofverifying the validity of the argument value, generating the path (e.g.,setting up or instantiating the path) based on the message (e.g., usingpath parameters), enforcing utilization of a path to conform toconstraint (e.g., a path usage parameter) where the argument valuesdefine a value that is acceptable or unacceptable for the constraint,etc.

In some embodiments, the PCC profiles (e.g., IDs and definition) may besolely stored on the PCC (e.g., and not accessibly by the PCC). In otherexamples, the PCC profiles (e.g., IDs and definition) may be accessibleby the PCE. In one implementation, the one or more argument values maybe stored (for transmission) in a portion of a PCEP message that istypically used for profile identifiers (e.g., a profile identifier fieldwithin a Profile ID TLV, or in an extended profile id field within aProfile ID TLV). Thus, from the perspective of the PCEP message, anargument value may be encoded as (and appear to be a profile ID).Because the extended PCEP messages for profiled IDs (disclosed herein)allow end users (e.g., system operators) to define the semantics ofprofile IDs in a PCEP message, the PCEP message may be used to carry anargument value within a field designated for a profile ID.

In an embodiment, the order of an ordered list (e.g., an ordered list ofProfile IDs and argument values and/or an ordered list of Profile IDsand attributes) may be predetermined, e.g. by a provisioning systemprior to providing the profiles to the PCC. The order may indicate aparticular order in which the profile identifiers and the attributesshould be received (e.g., when received from a PCE). An attribute mayinclude an abstract constraint for which a value is required toimplement the constraint. For example, Latency (or min. Latency) may beused as an attribute and may be implemented with a specific value forlatency (e.g., 5 ms). In one example, an attribute may correspond to aprofile (e.g., reference by its profile ID) configured to acceptparameters and/or argument values as input to the profile. As anotherexample, an ordered list may contain profile id (e.g., profile id 20)and attributes (e.g., priority setup, hold), where a particular order is(profile id 20, priority setup, hold). In another example, a differentparticular order may be (profile id 10, hold, priority setup). In theseexamples the following orders are not equal to one another (profile id20, priority setup, hold) (profile id 10, hold, priority setup). Whenthe PCC receives a message (e.g., a path initiate message) containing aprofile identifier, the PCC may use the memory to identify a profilecorresponding to the profile ID, which contains the specific order ofone or more profile identifiers and the at least one attribute. Usingthe order retrieved from the memory, the PCC can identify the argumentthat corresponds to the attribute, e.g., since the value of arguments inthe message should be in the order (with respect to the profile ID)retrieved from the memory. In other words, a profile identifier andcorresponding argument value may be provided in the message in an orderthat matches (or corresponds to) a particular order of a profileidentifier and an attribute in the ordered list (i.e., stored in thememory). The PCC may further identify the location of the argument valuein the message based on the location of the attribute in the profile.The PCC is able to use the order of the pairs of attributes andparameters stored within the profile definition to identify the argumentvalues in a request message. For example, the profile definition mayhave the following order (profile ID, attribute1, attribute2). Thus,when the PCE identifies the profile ID in a request message, it can usethe value that immediately follows the profile ID as the argument valuesfor attribute1, and the next consecutive value as the argument value forattribute2.

In an implementation, PCC 2002 may implement logic 1500, in addition toor in combination with the above described logic. PCE 2004 may implementlogic 1600, in addition to or in combination with the above describedlogic. The components and logic of system 1900 may be implemented asdescribed with respect to FIGS. 14, 15 and 16.

FIG. 21 is a table of exemplary encodings for profile objects, accordingto an embodiment of the present disclosure. The exemplary encodingsillustrate ways in which elements (e.g., profile IDS, argument values,attributes, etc.) may be placed in a specific ordered to encode arelationship between the elements. Table 2100 in FIG. 21, illustratestree data structures (in row 2102), where each tree contains a rootnodes (i.e., nodes a, b, c, and d) corresponds to profile object (e.g.,profile object 300). This tree represents an unordered set. In contrast,each of trees b, c, d and e represent an ordered list. The treesillustrate a hierarchical relationship between the nodes. Each of nodesthat descend from the root node (i.e., are child nodes of the root node)corresponds to profile IDs and/or argument values. Each root node hasone or more child nodes. In turn, each child may have child nodes of itsown. In general, each node (whether root, child, and/or leaf) cancomprise zero or more child nodes. Each of nodes 5, 6, 7, and 9represent a attribute (each referenced using a profile id equal to thenode number) due, at least in part, to the fact that the nodes (i.e.,the profile) utilize argument values (also called “parameters” in FIG.21) as input. Each argument value corresponds to an attribute. Eachattribute may correspond to one or more argument values (e.g., attribute9 receives as input argument values 1 and 4).

Tree a: Root node “a” comprises child nodes 1 and 2. In turn, nodes 1and 2 are leafs and have no children. This tree represents an unorderedset of profile identifiers.

Tree b: Root node “b” comprises child nodes 5 and 8. Node 5 is aattribute (or a profile Id that accepts parameters as argument values)and comprises child node 1. Node 1 is a parameter used as input to node5 (i.e., attribute 5). Node 5 has no children and is therefore a leafnode. Likewise, node 8 is a leaf node. Node 8 corresponds to a policy ofdisjointness between other paths associated with the profile identifier.

Tree c: Root node “c” comprises child nodes 6 and 7. Node 6 is aattribute (or a profile Id that accepts parameters as argument values)and comprises child nodes 1 and 2. Both of nodes 1 and 2 are parameters,which are used as input to node 6 (i.e., attribute 6). Nodes 1 and 2 arealso leaf nodes. Node 7 is a attribute and comprises child nodes 3, 2,4, and 1 (in that order). Each of nodes 3, 2, 4, and 1 is a parameter,which is used as input to node 7 (i.e., attribute 7). Each of nodes 3,2, 4, and 1 is a leaf node. Note the nodes 1 and 2 under node 6 are notthe same as (e.g., contain different values) nodes 1 and 2 under node 7.

Tree d: Root node “d” comprises child nodes 9 and 7. Node 9 is aattribute and comprises child nodes 1 and 4. Both of nodes 1 and 4 areparameters, which are used as input to node 9 (i.e., attribute 9). Nodes1 and 4 are also leaf nodes. Node 7 is a attribute and comprises childnodes 3, 5, and 6 (in that order). Each of nodes 3, 5, and 6 is aparameter, which is used as input to node 7 (i.e., attribute 7). Each ofnodes 3, and 5 is a leaf node. Node 6 is a attribute that is nestedunder node 7 (i.e., attribute 7). Node 6 comprises child nodes 1 and 4,which each represent a parameter used as input to node 9. Note the nodes1 and 2 under node 9 are not the same as (e.g., contain differentvalues) nodes 1 and 2 under node 7.

The example encodings is row 2104 may be encoded using Profile ID TLV400 (FIG. 4). For example for tree with root node b, the encodingdescribed in row 2104 may be encoded using an instance of a profileobject (e.g., profile object 300) comprising three Profile ID TLVs(e.g., 400) corresponding to the contents 5, 1 and 8. Thus, a firstProfile ID TLV may contain a profile identifier equal to 5, a secondProfile ID TLV may contain a profile identifier equal to 1, and a thirdProfile ID TLV may contain a profile identifier equal to 8. Note thatthe second Profile ID TLV has the value of the profile identifier fieldset to an argument value (i.e., and not to a profile id). For each tree,the profile object contents are listed in an order that they areencountered using a depth-first traversal of the tree.

The example encodings is row 2106 may be encoded using a Profile ID TLVincluding an extended profile identifier field. For example, FIG. 22illustrates a profile identifier TLV, which extends PCEP, according toan embodiment of the present disclosure. Profile ID TLV 2200 is analternative to Profile ID TLV 400. Profile ID TLV 2200 comprises a16-bit type 2202, a 16-bit length 2204, an 8-bit reserved portion 2206,and 8-bits for flags 2208, and 32-bit profile identifier 2210, and avariable bit length extended profile identifier 2212. The profileidentifier 2210, may be utilized as a PCC profile identifier or as PCEprofile identifier (e.g., for PCE-initiated paths, PCC-initiated paths,or both). The extended profile identifier 2212 may have a length of zeroor more bits. The value of the length field 2204 represents the length(in bits) of the Profile ID TLV (e.g., as measured from the start ofReserved field 2206 to the end of the extended profile identifier field2212). With the exception of extended profile identifier 2212, thelengths of all fields in are fixed (each field having a length (in bits)shown in FIG. 22). Thus, the value of length field 2204 may be used todetermine the length of the extended profile identifier 2212 (e.g., bythe subtracting length of the fixed length fields from the actual lengthof the Profile ID TLV). In some examples, the extended identifiersection is utilized to encode parameters values (argument values) thatassociated with the particular profile identifier in a given Profile IDTLV.

In an embodiment, the encodings of profile object described with respectto row 2106 (in FIG. 21) can be encoded in using Profile ID TLV 2200.For example for tree with root node b, the encoding described in row2106 may be encoded using an instance of a profile object (e.g., profileobject 300) comprising two Profile ID TLVs (e.g., 2200) corresponding tothe contents 5.1 and 8. For content 5.1, 5 represented the profile idand the 1 represents the argument value (or parameter). The dot (“.”) Isused to delineate the two values when the argument value is appended tothe profile ID (thereby extending the profile ID). Thus, in this examplethe, a first Profile ID TLV may contain a profile identifier equal to 5,with an extended profile identifier equal to 1. For content 8, “8”represents the profile id (there are no argument values for profile id8). A second Profile ID TLV may contain a profile identifier equal to 8,with an extended profile identifier that is (e.g., null). For each tree,the profile object contents are listed in an order that they areencountered using a depth-first traversal of the tree.

In other implementations, the example encodings is row 2104 may beencoded using Profile ID TLV 2200 (FIG. 22), e.g., by leaving extendedprofile id empty.

Variations and Implementations

As used herein, the PCEs and PCCs are nodes that can facilitate thecentralized path definition with distributed path setup control and/orthe centralized path setup control with distributed path utilizationconstraints activities discussed herein. As used herein in thisSpecification, the components of the framework, or “nodes” is meant toencompass routers, switches, cable boxes, gateways, bridges,loadbalancers, access concentrators, firewalls, inline service nodes,proxies, servers, processors, modules, or any other suitable device,component, element, proprietary appliance, or object operable toexchange information in a network environment. These nodes may includeany suitable hardware, software, components, modules, interfaces, orobjects that facilitate the operations thereof. This may be inclusive ofappropriate algorithms, communication protocols, and interfaces thatallow for the effective exchange of data or information for centralizedpath definition with distributed path setup control and for centralizedpath setup control with distributed path utilization constraints. A PCCand/or and PCE may be a node. These nodes are network nodes anddifferent from the nodes in the tree data structure in FIG. 21. Thenodes in FIG. 21 related to a data structure for storing relationshipsbetween objects.

In one implementation, one or more of the nodes include software toachieve (or to foster) the centralized path definition with distributedpath setup control and/or the centralized path setup control withdistributed path utilization constraints activities discussed herein.This could include, for example, the implementation of instances ofsoftware modules (where these modules interact, perform reciprocatingfunctions, and/or suitably coordinate their activities with peers).Additionally, each of these elements can have an internal structure(e.g., a processor, a memory element, etc.) to facilitate some of theoperations described herein. In other embodiments, these centralizedpath definition with distributed path setup control activities may beexecuted externally to these elements, or included in some other networkelement (or node) to achieve the intended functionality. Alternatively,one or more of the nodes may include software (or reciprocatingsoftware) that can coordinate with other network elements (or nodes) inorder to achieve the centralized path definition with distributed pathsetup control activities described herein. In still other embodiments,one or several devices may include any suitable algorithms, hardware,software, components, modules, interfaces, or objects that facilitatethe operations thereof.

Note that in certain example implementations, the functions outlinedherein associated with centralized path definition with distributed pathsetup control and centralized path setup control with distributed pathutilization constraints may be implemented in logic encoded in one ormore non-transitory media (e.g., embedded logic provided in anapplication specific integrated circuit [ASIC], digital signal processor[DSP] instructions, software [potentially inclusive of object code andsource code] to be executed by a processor, or other similar machine,etc.). In some of these instances, a memory can store data used for theoperations described herein. This includes the memory being able tostore instructions (e.g., software, logic, processor instructions, etc.)that can be executed to carry out the activities described in thisSpecification. A processor can execute any type of instructionsassociated with the data to achieve the operations detailed herein inthis Specification. In one example, the processor could transform anelement or an article (e.g., data) from one state or thing to anotherstate or thing. In another example, the activities outlined herein maybe implemented with fixed logic or programmable logic (e.g.,software/computer instructions executed by a processor) and the elementsidentified herein could be some type of a programmable processor,programmable digital logic (e.g., a field programmable gate array[FPGA], an erasable programmable read only memory (EPROM), anelectrically erasable programmable ROM (EEPROM)) or an ASIC thatincludes digital logic, software, code, electronic instructions, or anysuitable combination thereof.

Furthermore, various memory items (e.g., databases, tables, queues,buffers, caches, trees, etc.) should be construed as being encompassedwithin the broad term ‘memory element.’ Similarly, any of the potentialprocessing elements, modules, and machines described in thisSpecification should be construed as being encompassed within the broadterm ‘processor.’

Note that with the example provided above, as well as numerous otherexamples provided herein, interaction may be described in terms of two,three, or four network elements or nodes. However, this has been donefor purposes of clarity and example only. In certain cases, it may beeasier to describe one or more of the functionalities of a given set offlows by only referencing a limited number of network elements (ornodes). It should be appreciated that the present disclosure (and itsteachings) are readily scalable and can accommodate a large number ofcomponents, as well as more complicated/sophisticated arrangements andconfigurations. Accordingly, the examples provided should not limit thescope or inhibit the broad teachings of the present disclosure aspotentially applied to a myriad of other architectures.

It is important to note that the steps illustrated in the presentdisclosure illustrate only some of the possible signaling scenarios andpatterns that may be executed by, or within, one or more nodes. Some ofthese steps may be deleted or removed where appropriate, or these stepsmay be modified or changed considerably without departing from the scopeof the present disclosure. In addition, a number of these operationshave been described as being executed concurrently with, or in parallelto, one or more additional operations. However, the timing of theseoperations may be altered considerably. If desired, the differentfunctions discussed herein may be performed in a different order and/orconcurrently with each other. Furthermore, if desired, one or more ofthe above-described functions may be optional or may be combined. Thepreceding operational flows have been offered for purposes of exampleand discussion. Substantial flexibility is provided by the one or morenodes in that any suitable arrangements, chronologies, configurations,and timing mechanisms may be provided without departing from theteachings of the present disclosure.

Although the present disclosure has been described in detail withreference to particular arrangements and configurations, these exampleconfigurations and arrangements may be changed significantly withoutdeparting from the scope of the present disclosure. Additionally,although the one or more nodes has been illustrated with reference toparticular elements and operations that facilitate the centralized pathdefinition with distributed path setup control process, these elementsand operations may be replaced by any suitable architecture or processthat achieves the intended functionality of these one or more nodes.

Numerous other changes, substitutions, variations, alterations, andmodifications may be ascertained to one skilled in the art and it isintended that the present disclosure encompass all such changes,substitutions, variations, alterations, and modifications as fallingwithin the scope of the appended claims. In order to assist the UnitedStates Patent and Trademark Office (USPTO) and, additionally, anyreaders of any patent issued on this application in interpreting theclaims appended hereto, Applicant wishes to note that the Applicant: (a)does not intend any of the appended claims to invoke paragraph six (6)of 35 U.S.C. section 112 as it exists on the date of the filing hereofunless the words “means for” or “step for” are specifically used in theparticular claims; and (b) does not intend, by any statement in thespecification, to limit this disclosure in any way that is not otherwisereflected in the appended claims.

1.-20. (canceled)
 21. A method comprising: storing, in a memoryaccessible by a first network element, an ordered list comprising aprofile identifier and at least one attribute associated with theprofile identifier, wherein the profile identifier and the at least oneattribute are provided in a particular order in the ordered list;receiving a path computation element communication protocol (PCEP)message, from a second network element, comprising at least one profileidentifier and at least one argument value associated with each of theat least one profile identifier; in response to determining that the atleast one profile identifier in the PCEP message comprises the profileidentifier, processing the PCEP message to identify the at least oneargument value based on the particular order in the ordered list; andexecuting, by the first network element, an action based on the at leastone argument value identified in the processing.
 22. The method of claim21, wherein the first network element is a path computation element(PCE) the second network element is a path computation client (PCC). 23.The method of claim 21, wherein the first network element is a pathcomputation client (PCC) the second network element is a pathcomputation element (PCE).
 24. The method of claim 22, wherein the PCEPmessage is a PCEP path computation request message comprising the atleast one profile identifier and the at least one argument valueassociated with each of the at least one profile identifier, and the atleast one argument value is encoded in a portion of the PCEP pathcomputation request message used for extended profile identifiers. 25.The method of claim 22, wherein the executing the action comprisesgenerating a PCEP path computation reply message based on the profileidentifier, the at least one attribute, and the at least one argumentvalue identified in the processing.
 26. The method of claim 23, whereinthe PCEP message is a PCEP path initiate message comprising the at leastone profile identifier and the at least one argument value associatedwith each of the at least one profile identifier, and the at least oneargument value is encoded in a portion of the PCEP path initiate messageused for extended profile identifiers.
 27. The method of claim 23,wherein the executing the action comprises generating, by the PCC, apath based at least in part on the profile identifier, the at least oneattribute, and the at least one argument value identified in theprocessing.
 28. The method of claim 21, wherein the processing the PCEPmessage to identify the at least one argument value based on theparticular order in the ordered list comprises: determining that the atleast one profile identifier and at least one argument value isprovided, in the PCEP message, in an order that corresponds to theparticular order of the profile identifier and the at least oneattribute; and identifying the at least one argument value based on alocation of the at least one attribute in the particular order.
 29. Themethod of claim 21, wherein the particular order corresponds to ahierarchical relationship between the profile identifier and the atleast one attribute.
 30. The method of claim 29, wherein thehierarchical relationship between the profile identifier and the atleast one attribute comprises the profile identifier being a parent nodeof a plurality of nodes in a tree data structure and the at least oneattribute being a child node of the plurality of nodes in the tree datastructure.
 31. A method comprising: generating, by a first networkelement, a path computation element communication protocol (PCEP)message comprising at least one profile identifier and at least oneargument value associated with each of the at least one profileidentifier, wherein the at least one profile identifier and at least oneargument value are provided in an order in the PCEP message; andtransmitting the PCEP message to a second network element, wherein thePCEP message causes the second network element to execute an action inresponse to determining that the order in the PCEP message correspondsto a particular order of a profile identifier and at least one attributeassociated with the profile identifier stored on the second networkelement.
 32. The method of claim 31, wherein the first network elementis a path computation element (PCE) the second network element is a pathcomputation client (PCC).
 33. The method of claim 31, wherein the firstnetwork element is a path computation client (PCC) the second networkelement is a path computation element (PCE).
 34. The method of claim 32,wherein the PCEP message is a PCEP path initiate message comprising theat least one profile identifier and the at least one argument valueassociated with each of the at least one profile identifier, and the atleast one argument value is encoded in a portion of the PCEP pathinitiate message used for extended profile identifiers.
 35. The methodof claim 33, wherein the PCEP message is a PCEP path computation requestmessage comprising the at least one profile identifier and the at leastone argument value associated with each of the at least one profileidentifier, and the at least one argument value is encoded in a portionof the PCEP path computation request message used for extended profileidentifiers.
 36. The method of claim 31, wherein the processing the PCEPmessage to identify the at least one argument value based on theparticular order in the ordered list comprises: determining that the atleast one profile identifier and at least one argument value isprovided, in the PCEP message, in an order that corresponds to theparticular order of the profile identifier and the at least oneattribute; and identifying the at least one argument value based on alocation of the at least one attribute in the particular order.
 37. Asystem comprising: a first network element comprising a memory storingan ordered list comprising at least one profile identifier and at leastone attribute associated with the at least one profile identifier,wherein the at least one profile identifier and the at least oneattribute are provided in a particular order in the ordered list; asecond network element comprising a memory storing a profile identifierand at least one argument value associated with the profile identifier;a communication media operatively coupled to and enabling communicationbetween the first network element and the second network element;wherein the second network element transmits a path computation elementcommunication protocol (PCEP) message, to the first network element viathe communication media, comprising the profile identifier and the atleast one argument value associated with the profile identifier; andwherein the first network element, processes the PCEP message toidentify the at least one argument value based on the particular orderin the ordered list and executes an action based on the at least oneargument value identified in the processing.
 38. The system of claim 37,wherein the processing the PCEP message to identify the at least oneargument value based on the particular order in the ordered listcomprises: determining that the at least one profile identifier and atleast one argument value is provided, in the PCEP message, in an orderthat corresponds to the particular order of the profile identifier andthe at least one attribute; and identifying the at least one attributebased on a location of the at least one attribute in the particularorder.
 39. At least one computer-readable non-transitory mediumcomprising one or more instruction, that when executed by one or moreprocessors configure the one or more processor to perform one or moreoperations comprising: storing, in a memory accessible by a firstnetwork element, an ordered list comprising a profile identifier and atleast one attribute associated with the profile identifier; wherein theprofile identifier and the at least one attribute are provided in aparticular order in the ordered list; receiving a path computationelement communication protocol (PCEP) message, from a second networkelement, comprising at least one profile identifier and at least oneargument value associated with each of the at least one profileidentifier; in response to determining that the at least one profileidentifier in the PCEP message comprises the profile identifier,processing the PCEP message to identify the at least one argument valuebased on the particular order in the ordered list; and executing, by thefirst network element, an action based on the at least one argumentvalue identified in the processing.
 40. At least one computer-readablenon-transitory medium comprising one or more instruction, that whenexecuted by one or more processors configure the one or more processorto perform one or more operations comprising: generating, by a firstnetwork element, a path computation element communication protocol(PCEP) message comprising at least one profile identifier and at leastone argument value associated with each of the at least one profileidentifier, wherein the at least one profile identifier and at least oneargument value are provided in an order in the PCEP message; andtransmitting the PCEP message to a second network element, wherein thePCEP message causes the second network element to execute an action inresponse to determining that the order in the PCEP message correspondsto a particular order of a profile identifier and at least one attributeassociated with the profile identifier stored on the second networkelement.